Transient Nearest Neighbor Random Walk and Bessel Process
نویسندگان
چکیده
منابع مشابه
Transient Nearest Neighbor Random Walk and Bessel Process
We prove strong invariance principle between a transient Bessel process and a certain nearest neighbor (NN) random walk that is constructed from the former by using stopping times. We show that their local times are close enough to share the same strong limit theorems. It is also shown, that if the di erence between the distributions of two NN random walks are small, then the walks themselves c...
متن کاملNearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...
متن کاملRandom nearest neighbor and influence graphs on Zd
Random nearest neighbor and influence graphs with vertex set Zd are defined and their percolation properties are studied. The nearest neighbor graph has (with probability 1) only finite connected components and a superexponentially decaying connectivity function. Influence graphs (which are related to energy minimization searches in disordered Ising models) have a percolation transition. © 1999...
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملRange of a Transient 2d-Random Walk
We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed (”averaged”) cases. We also express the rate of growth in terms of the quenched Green function and eventually prove a weak law of large numbers in the (non-Markovian) annealed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Probability
سال: 2008
ISSN: 0894-9840,1572-9230
DOI: 10.1007/s10959-008-0165-7